Learning Spectral Clustering
نویسندگان
چکیده
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same cluster having high similarity and points in different clusters having low similarity. In this paper, we derive a new cost function for spectral clustering based on a measure of error between a given partition and a solution of the spectral relaxation of a minimum normalized cut problem. Minimizing this cost function with respect to the partition leads to a new spectral clustering algorithm. Minimizing with respect to the similarity matrix leads to an algorithm for learning the similarity matrix. We develop a tractable approximation of our cost function that is based on the power method of computing eigenvectors.
منابع مشابه
Learning Deep Representations for Graph Clustering
Recently deep learning has been successfully adopted in many applications such as speech recognition and image classification. In this work, we explore the possibility of employing deep learning in graph clustering. We propose a simple method, which first learns a nonlinear embedding of the original graph by stacked autoencoder, and then runs k-means algorithm on the embedding to obtain cluster...
متن کاملSpectral Clustering for Complex Settings
of the Dissertation Spectral Clustering for Complex Settings Many real-world datasets can be modeled as graphs, where each node corresponds to a data instance and an edge represents the relation/similarity between two nodes. To partition the nodes into different clusters, spectral clustering is used to find the normalized minimum cut of the graph (in the relaxed sense). As one of the most popul...
متن کاملA Probabilistic Approach for Optimizing Spectral Clustering
Spectral clustering enjoys its success in both data clustering and semisupervised learning. But, most spectral clustering algorithms cannot handle multi-class clustering problems directly. Additional strategies are needed to extend spectral clustering algorithms to multi-class clustering problems. Furthermore, most spectral clustering algorithms employ hard cluster membership, which is likely t...
متن کاملNoise Thresholds for Spectral Clustering
Although spectral clustering has enjoyed considerable empirical success in machine learning, its theoretical properties are not yet fully developed. We analyze the performance of a spectral algorithm for hierarchical clustering and show that on a class of hierarchically structured similarity matrices, this algorithm can tolerate noise that grows with the number of data points while still perfec...
متن کاملActive Learning with Clustering
Active learning is an important field of machine learning and it is becoming more widely used in case of problems where labeling the examples in the training data set is expensive. In this paper we present a clustering-based algorithm used in the Active Learning Challenge. The algorithm is based on graph clustering with normalized cuts, and uses kmeans to extract representative points from the ...
متن کاملSpectral Clustering With
Clustering is a fundamental problem in machine learning with numerous important applications in statistical signal processing, pattern recognition, and computer vision, where unsupervised analysis of data classification structures are required. The current stateof-the-art in clustering is widely accepted to be the socalled spectral clustering. Spectral clustering, based on pairwise affinities o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003